Ant Colony Algorithms For The Vehicle Routing Problem With Time Window, Period And Multiple Depots

Vehicle Routing Problem is a common problem in logistics, which can simulate in-plant and out-plant material handling. In the article, we demonstrate Problem, contains period, time window multiple depots. this case, customers must be served from several The position of nodes (depots customers), demand are known advance. number capacity constraint vehicles predefined. leave one depot, visit some then return to depot. above-described vehicle routing solved with construction algorithms Ant Colony algorithms. used improve random solutions generated According test results Elitist Strategy System Rank-Based Version gave best solutions.